Optimistic Selection of Cluster Heads Based on Facility Location Problem in Cluster-Based Routing Protocols

Cluster-based routing protocols are one of the most favorable approaches for energy management in wireless sensor networks. The selection of the best cluster heads (CHs), as well as the formation of optimal clusters, is an NP-hard problem. The present study proposes an optimal solution for CHs selection to generate a network topology with optimized network performance. The problem is formulated as facility location problem and a linear programming model is used to solve the optimization problem. Results of analysis o the network simulator (NS2) indicate that applying this method in cluster-based routing protocols prolongs 16% of the network lifetime, increases 15.5% of data transmission and improves 5.5% of throughput, as compared to the results of current heuristic methods such as LEACH, DEEC and EDFCM protocols.